Towards Predictable, High-Performance Memory Hierarchies in Fixed-Priority Preemptive Multitasking Real-Time Systems
نویسنده
چکیده
Cache memories are crucial to obtain high performance on contemporary computing systems. However, sometimes they have been avoided in real-time systems due to their lack of determinism. Unfortunately, most of the published techniques to attain predictability when using cache memories are complex to apply, precluding their use on real applications. This paper proposes a memory hierarchy such that, when combined with a careful pre-existing selection of the instruction cache contents, it brings an easy way to obtain predictable yet high-performance results. The purpose is to make possible the use of instruction caches in realistic realtime systems, with the ease of use in mind. The hierarchy is founded on a conventional instruction cache based scheme plus a simple memory assist, whose operation offers a very predictable behaviour and good performance thanks to the addition of a dedicated locking state memory.
منابع مشابه
Allocation of Multirate Systems on Multiprocessors with Memory Hierarchy Modeling and Optimization
The paper presents a task allocation scheme for system-level synthesis of multirate real-time tasks on multiprocessors with memory hierarchies. The allocation algorithm is the first to take into account the effect of memory hierarchies at task level and optimizes for it. The algorithm is based on a task-level model of hierarchical memories first proposed in our previous work [1]. Caches are ess...
متن کاملModeling Fixed-Priority Preemptive Multi-Task Systems in SpecC
Many real-world embedded systems employ a preemptive scheduling policy in order to satisfy their realtime requirements. However, most System-Level Design Languages (SLDLs) which were proposed up to now, such as SpecC, do not explicitly support modeling of preemptions. This paper proposes techniques for modeling xed-priority preemptive multi-task systems in the SpecC SLDL. The modeling technique...
متن کاملTowards a Predictable, High-Performance Instruction Memory Hierarchy in Fixed-Priority Preemptive Real-Time Systems
Contemporary computing architectures make an extensive use of cache memories to cope with the increasing speed gap between the processing power of the processing element and the bandwidth of the memory subsystem. In a fixed-priority preemptive real-time system, in addition to obtaining logically correct results, it is also mandatory to satisfy timing constraints. Since the contents of the cache...
متن کاملA Non-Preemptive Two-Class M/M/1 System with Prioritized Real-Time Jobs under Earliest-Deadline-First Policy
This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...
متن کاملTool support for the construction of statically analysable hard real-time Ada systems
This paper maintains that fixed-priority process-based preemptive scheduling is, arguably, more convenient, flexible and responsive than conventional cyclic scheduling for the construction of new-generation software-intensive satellite control systems. Predictable usage of preemptive priority-based scheduling, however, demands the support of mature static analysis techniques. Worst-case respons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007